Blockchain tracking of virtual universe traversal results

ABSTRACT

An exemplary computer-implemented method includes obtaining at least one teleportation invite block that records a virtual universe teleportation invite marked by at least one parameter. The teleportation invite identifies a virtual universe user as an invitee. Responsive to the parameter, assess whether the virtual universe teleportation invite is potentially malicious, and alert the invitee in case the virtual universe teleportation invite is potentially malicious. Another exemplary computer-implemented method includes obtaining at least one complaint block that records a complaint made against a virtual universe user; obtaining a plurality of traversal blocks that record virtual universe traversal events by the virtual universe user; identifying a pattern of harassment by analyzing a first plurality of traversal blocks that precede the complaint block; identifying a risk of future harassment by analyzing a second plurality of traversal blocks that follow the complaint block; and issuing an alert regarding the risk of future harassment.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.15/859,436 filed 30 Dec. 2017, which is in turn a continuation of U.S.patent application Ser. No. 15/581,084 filed Apr. 28, 2017, the completedisclosures of both which are expressly incorporated herein by referencein their entireties for all purposes.

BACKGROUND

The present invention relates to the electrical, electronic and computerarts, and more specifically, to virtual universes.

A VU (virtual universe) is a computer-implemented simulation intendedfor its users to traverse, inhabit, and interact through the use ofavatars. Many VUs are represented using 3-D graphics and landscapes, andare populated by many thousands of users, known as “residents.” VUs(virtual universes) are traversed by such methods as walking, flying,and teleporting. A teleport provides a mechanism to travel rapidly fromone location in a VU to another location, even if the locations aregeographically far apart. In typical virtual universes, an invitationfor teleporting may be received that is an offer to transport therecipient from a recipient's current location to a second location. Auser may reject or accept the offer for teleporting. If the user acceptsthe offer, for example by selecting the invitation presented as words onthe VU GUI, the user's avatar is then transported from the currentlocation to the second location. In practical terms, teleportationrefers to the “re-rendering” of an avatar in a different environment.This re-rendering may occur on the same processor within the samesimulation engine; it may occur on a different processor within the samesimulation engine; on the same processor with a different simulationengine; or a different processor with a different simulation engine.

SUMMARY

In view of the present disclosure, it will be understood that principlesof the invention provide techniques for blockchain tracking of virtualuniverse traversal results. In one aspect, an exemplarycomputer-implemented method includes obtaining at least oneteleportation invite block that records a virtual universe teleportationinvite marked by at least one parameter, where the teleportation inviteidentifies a virtual universe user as an invitee. The exemplary methodalso includes assessing, responsive to the parameter, whether thevirtual universe teleportation invite is potentially malicious, andalerting the invitee in case the virtual universe teleportation inviteis potentially malicious.

In another aspect, an exemplary computer-implemented method includesobtaining at least one complaint block that records a complaint madeagainst a virtual universe user; obtaining a plurality of traversalblocks that record virtual universe traversal events by the virtualuniverse user; identifying a pattern of harassment by analyzing a firstplurality of traversal blocks that precede the complaint block;identifying a risk of future harassment by analyzing a second pluralityof traversal blocks that follow the complaint block; and issuing analert regarding the risk of future harassment.

Certain embodiments of the invention provide an apparatus that includesa memory encoded with computer-executable instructions and a processoroperatively coupled in communication with the memory. The processor isconfigured by the computer-executable instructions to facilitate any ofthe methods above discussed.

As used herein, “facilitating” an action includes performing the action,making the action easier, helping to carry the action out, or causingthe action to be performed. Thus, by way of example and not limitation,instructions executing on one processor might facilitate an actioncarried out by instructions executing on a remote processor, by sendingappropriate data or commands to cause or aid the action to be performed.For the avoidance of doubt, where an actor facilitates an action byother than performing the action, the action is nevertheless performedby some entity or combination of entities.

One or more embodiments of the invention or elements thereof can beimplemented in the form of a computer program product including acomputer readable storage medium with computer usable program code forperforming the method steps indicated. Furthermore, one or moreembodiments of the invention or elements thereof can be implemented inthe form of a system (or apparatus) including a memory, and at least oneprocessor that is coupled to the memory and operative to performexemplary method steps. Yet further, in another aspect, one or moreembodiments of the invention or elements thereof can be implemented inthe form of means for carrying out one or more of the method stepsdescribed herein; the means can include (i) hardware module(s), (ii)software module(s) stored in a computer readable storage medium (ormultiple such media) and implemented on a hardware processor, or (iii) acombination of (i) and (ii); any of (i)-(iii) implement the specifictechniques set forth herein.

These and other features and advantages of the present invention willbecome apparent from the following detailed description of illustrativeembodiments thereof, which is to be read in connection with theaccompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a cloud computing environment according to an embodimentof the present invention;

FIG. 2 depicts abstraction model layers according to an embodiment ofthe present invention;

FIG. 3 depicts in flowchart form a method for virtual universe traversalresult tracking, according to embodiments of the invention;

FIG. 4 illustrates in flowchart form a method for identifying ateleportation invite as potentially malicious, according to embodimentsof the invention;

FIG. 5 depicts in flowchart form another method for identifying ateleportation invite as potentially malicious, according to embodimentsof the invention;

FIG. 6 illustrates in flowchart form another method for identifying ateleportation invite as potentially malicious, according to embodimentsof the invention;

FIG. 7 depicts in flowchart form a method for identifying a risk ofharassment in a virtual universe, according to embodiments of theinvention; and

FIG. 8 depicts a computer system that may be useful in implementing oneor more aspects and/or elements of the invention, also representative ofa cloud computing node according to an embodiment of the presentinvention.

DETAILED DESCRIPTION

It is understood in advance that although this disclosure includes adetailed description on cloud computing, implementation of the teachingsrecited herein are not limited to a cloud computing environment. Rather,embodiments of the present invention are capable of being implemented inconjunction with any other type of computing environment now known orlater developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g. networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported providing transparency for both theprovider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based email). Theconsumer does not manage or control the underlying cloud infrastructureincluding network, servers, operating systems, storage, or evenindividual application capabilities, with the possible exception oflimited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting for loadbalancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure comprising anetwork of interconnected nodes.

Referring now to FIG. 1, illustrative cloud computing environment 50 isdepicted. As shown, cloud computing environment 50 includes one or morecloud computing nodes 10 with which local computing devices used bycloud consumers, such as, for example, personal digital assistant (PDA)or cellular telephone 54A, desktop computer 54B, laptop computer 54C,and/or automobile computer system 54N may communicate. Nodes 10 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as Private, Community,Public, or Hybrid clouds as described hereinabove, or a combinationthereof. This allows cloud computing environment 50 to offerinfrastructure, platforms and/or software as services for which a cloudconsumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 54A-N shownin FIG. 1 are intended to be illustrative only and that computing nodes10 and cloud computing environment 50 can communicate with any type ofcomputerized device over any type of network and/or network addressableconnection (e.g., using a web browser).

Referring now to FIG. 2, a set of functional abstraction layers providedby cloud computing environment 50 (FIG. 1) is shown. It should beunderstood in advance that the components, layers, and functions shownin FIG. 2 are intended to be illustrative only and embodiments of theinvention are not limited thereto. As depicted, the following layers andcorresponding functions are provided:

Hardware and software layer 60 includes hardware and softwarecomponents. Examples of hardware components include: mainframes 61; RISC(Reduced Instruction Set Computer) architecture based servers 62;servers 63; blade servers 64; storage devices 65; and networks andnetworking components 66. In some embodiments, software componentsinclude network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers71; virtual storage 72; virtual networks 73, including virtual privatenetworks; virtual applications and operating systems 74; and virtualclients 75.

In one example, management layer 80 may provide the functions describedbelow. Resource provisioning 81 provides dynamic procurement ofcomputing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and Pricing 82provide cost tracking as resources are utilized within the cloudcomputing environment, and billing or invoicing for consumption of theseresources. In one example, these resources may include applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal 83 provides access to the cloud computing environment forconsumers and system administrators. Service level management 84provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 85 provide pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 90 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 91; software development and lifecycle management 92; virtualclassroom education delivery 93; data analytics processing 94;transaction processing 95; and a virtual universe traversal resulttracking module 96.

Embodiments of the invention are applicable to a virtual universe(“VU”). A VU is typically a busy place with many thousands of users andfriends logged on at any moment. If a single user is sent numerousteleport invitations, the user may not want to interrupt the user'scurrent activity or work in order to accept the invitations. Multipleteleport invitation popup windows can clutter a user's screendistracting from the current activity. Users may also wish to considerteleport invitations when a more appropriate time is available, givingthe user the option to accept, reject, or save the invitation. Onceusers have received multiple teleport invitations, there is presently noway to prioritize or administer the invitations. Prioritization ofteleport invitations is especially important in areas related tobusiness applications where teleport invitations represent system eventnotifications that require immediate attention. Teleport invitations maybe selectable from a queue so the user can accept the invitation, rejectit, save it, or forward it to a friend or group. Users may also desirethe ability to setup default priorities responsive to the invitationsenders, and invitation type. In some embodiments, automatic rules andagents may reduce the need for users to take active steps to setspriorities.

Advantageously, certain embodiments of the invention provide a record ofsuch teleportation transactions. For example, such a record may make iteasier to track mischief-makers, users who inappropriately obtain itemsfrom other users' avatars, and related VU users. Such a record may alsobe useful in a court case to establish a trail that may precede afinancial or even social transaction, or to help a user of an avatar toconfirm his or her identity. It may be useful for a gamer to validatevarious aspects of game play, question, traversals through a world, etc.It may be useful to investigate patterns of harassment. It also may beuseful when investigating the provenance of an avatar or an expensivevirtual item.

Advantageously, certain embodiments of the invention more specificallyprovide a record of the results of teleportation transactions, regardingthe ability of virtual universe users to traverse the virtual universeafter acceptance of teleportation invites to a given location. This maybe useful in mitigating a particular type of harassment or “griefing” inwhich a “griefer” sends virtual universe users malicious teleportationinvites that target an inescapable destination. Naïve acceptance of suchan invite can essentially permanently terminate a user's virtualuniverse experience (absent some form of administrator intervention toreset the user's location; not all virtual universes provide for orpermit such intervention).

Advantageously, certain embodiments of the invention enable the virtualuniverse to alert users to potentially malicious teleportation invites,responsive to the traversal results of users who previously haveaccepted invites that (a) target the same destination or (b) are issuedby the same host.

Advantageously, certain embodiments of the invention enable the virtualuniverse to maintain a record of the results (complaints) produced byvirtual universe traversal events by a given virtual universe user. Sucha record can be analyzed to identify particular patterns of virtualuniverse traversal events that produce complaints from other users. Forexample if a given user has been identified by another user as a“griefer” or “stalker”, the system can analyze the given user's recordof traversal events in a rule-based manner to identify traversal events,involving the other user, that constitute a pattern of harassmentpreceding the complaint. Further, the system then can match the patternof harassment to more recent traversal events by the given user in orderto identify a risk of harassment. The system then can alert the givenuser, or another user, regarding the risk of harassment.

A “griefer” denotes a VU user who deliberately irritates and harassesother users within the VU, using aspects of the VU in unintended ways. Agriefer derives pleasure primarily or exclusively from the act ofannoying other users, and as such is a particular nuisance in onlinegaming communities, since griefers often cannot be deterred by penaltiesrelated to in-game goals. Griefers may partake in massively multiplayeronline role-playing games (MMORPG). Related negative behaviors includeinappropriate language, cheating, excessive volume of communications,blocking a player, stealing, unreasonable “killing” of other users'avatars, threatening, making unwelcome advances, and using in-game bugs(exploits) for trapping teammates in inescapable locations by physicsprops, special abilities, or teleportation into inescapable locations.

A blockchain is a distributed permissionless or permissioned ledger thatmaintains a continuously growing list of data records hardened againsttampering and revision. It consists of data structure blocks—which holdexclusively data in initial blockchain implementations, and both dataand programs in some of the more recent implementations—with each blockholding batches of individual transactions and the results of anyblockchain executables (“chaincode”). Each block contains a timestampand information (e.g., a hash of a previous block) that links it to aprevious block. Thus, a blockchain can serve as a public or proprietarynetwork ledger of transactions committed by the users associated withthe blockchain. Blockchain is peer-to-peer. Additionally, the blockchainresides not in a single server, but across a distributed network ofcomputers. Accordingly, whenever new transactions occur, the peers ofthe distributed network authenticate the additions to the blockchain.Permissionless blockchain implementations allow any user to connect tothe network, send new transactions to it, verify transactions, andcreate new blocks. In permissioned blockchain, only authorized users maysign and verify transactions. According to some implementations ofpermissioned blockchain, users initially can be authorized by hard-codedchaincode; thereafter the chaincode can be modified to authorize newusers by consent of the existing authorized users.

Distributed recording and authentication provide substantial beneficialtechnical effects of blockchain technology: (1) The ability forindependent nodes to converge on a consensus of the latest version of alarge data set such as a ledger, even when the nodes are runanonymously, have poor interconnectivity and have operators who aredishonest or malicious. (2) The ability for any well-connected node todetermine, with reasonable certainty, whether a transaction does or doesnot exist in the data set. (3) The ability for any node that creates atransaction to, after a confirmation period, determine with a reasonablelevel of certainty whether the transaction is valid, able to take placeand become final (i.e., that no conflicting transactions were confirmedinto the blockchain elsewhere that would invalidate the transaction,such as the same currency units “double-spent” somewhere else). (4) Aprohibitively high cost to attempt to rewrite or alter transactionhistory. (5) Automated conflict resolution that ensures that conflictingtransactions (such as two or more attempts to spend the same balance indifferent places) never become part of the confirmed data set.

Accordingly, embodiments of the invention utilize blockchain technologyto securely track and maintain a record of traversal events in a virtualuniverse (VU) or 3D game. VU traversal transactions associated with astakeholder are compiled into a chain of traversal transaction blocks.The chain can be considered a chronicle of the user's traversal paththroughout the user's game life. When a transaction is conducted, anycorresponding parameters (e.g., including source location, destination,time, traversal mechanism) are validated by blockchain users runningvalidation modules. The validation modules compare the transaction topre-defined VU rules, and generate a new block in case the rules aresatisfied. In some implementations, the VU rules may be recorded inchaincode. Once the new block has been generated, it can be appended tothe user's traversal blockchain.

A traversal blockchain block records the data relevant to a transaction(traversal event): the send id, receiver id, an item or avatar token(the fingerprint of the item or avatar using which historical details ofthe item or avatar can be retrieved), metadata information (e.g.timestamp, location, path taken, etc.), distance traveled, VU or 3Dcontext/environment information, etc. In this context, a transactionincludes the traversal of an avatar or item in the VU or 3D. Accordingto select embodiments of the invention, traversal includes walking,running, vehicular access, flying, or teleportation. The genesis blockof the teleportation blockchain may store the hash values of all thepossible ways to teleport. It may contain a hash of the World Map,landmark information, and destination guide. The update of ways ofteleportation also triggers an update transaction to embodiments of theinventive blockchain system. The validating devices that run thechaincode to validate an update transaction may encode variouscustomized algorithms including graph analysis, graph searching,landmark identification and detection, etc.

One or more embodiments of the invention also include blockchain reversecorrelation (“BCRC”) based on human behaviors, and contextual datarecorded in the traversal blockchain block records relevant to atransaction (traversal event). The Specifically, a user may traverse avirtual universe in specific patterns associated with user subsequentbehavior. Sometimes, a user may not even be aware that depending on thistraversal pattern, the user's behavior may or may not have a higherlikelihood of resulting in bad behavior as perceived by recipients ofthe user's actions. A BCRC is a statistical measure of events precedinga virtual universe traversal event. BCRC is optimal for detecting andalerting a user, or controlling access of the user to specificlocations, in response to obtaining a probability that the user's pastor current traversal pattern is likely to result in griefer behavior.BCRC makes use of a griefer behavior complaint against a given user byanother user of the VU to trigger the accessing of the blockchain inorder to perform statistics on the blocks that precede the complaint bysome number of steps and/or a specified amount of time. After thestatistical learning component achieves a confidence level (C) that apredictive pattern has been learned, certain embodiments of the systeminitiate ongoing analysis of the given user's traversal blockchain tosupport human alerting and intervention responsive to the blockchainstatistics.

Another implementation of BCRC involves a rating analysis of ateleportation destination and/or a rating analysis of teleportationinvites by a given user (griefer analysis), along with a triggeringalert system for identifying, to an invited user, a potentiallymalicious teleportation invite.

Accordingly, referring to FIG. 3, the virtual universe traversal resulttracking module 96 implements a method 300 for virtual universetraversal result tracking. The method 300 includes obtaining 302 atleast one teleportation acceptance block 304 of a blockchain thatrecords VU traversal transactions. The teleportation acceptance block304 records a virtual universe teleportation acceptance 306 that ismarked by at least one parameter 308. According to certainimplementations, the at least one parameter 308 identifies a virtualuniverse location as the destination of the teleportation acceptance.According to other implementations, the at least one parameter 308identifies a virtual universe user as the host that issued ateleportation invite underlying the teleportation acceptance. Someimplementations include both the destination and the host as parametersfor marking the teleportation acceptance.

The method 300 also includes obtaining 310 at least one teleportationinvite block 312 that records a virtual universe teleportation invite314 also marked by the parameter 308. Notably, the teleportationacceptance block may be obtained before or after obtaining theteleportation invite block; a parameter of the teleportation invite maybe used to obtain the teleportation acceptance block, or a parameter ofthe teleportation acceptance may be used to obtain the teleportationinvite block.

Generally, the teleportation invite 314 identifies a virtual universeuser as an invitee 316. Responsive to traversal blocks 317 that followthe teleportation acceptance block 304, the virtual universe traversalresult tracking module 96 assesses 318 whether the virtual universeteleportation invite 314 is potentially malicious. FIGS. 4-6 depictdifferent modes for assessing whether the virtual universe teleportationinvite 314 is potentially malicious.

In case the virtual universe traversal result tracking module 96designates 319 the virtual universe teleportation invite as potentiallymalicious, then the method 300 proceeds to alert 320 the invitee 316.

Referring to FIG. 4, a protocol for assessing 318 whether the virtualuniverse teleportation invite 314 is potentially malicious relates tothe parameter 308 that identifies a virtual universe user as a host 400of the invite 314. In this case the assessment 318 includes assessing401 whether the host 400 is potentially malicious. First, obtain, atstep 404, a plurality 406 of teleportation acceptance blocks 407 thatidentify the host 400; each of the teleportation acceptance blocksdefines a virtual universe user as an acceptor 408. Also obtain for eachacceptor 408, at step 410, a plurality 412 of traversal blocks 317 thatrecord virtual universe traversal events by the acceptor 408. Thenanalyze, at step 414, each plurality 412 of traversal blocks 317 in aneffort to identify “continuing” virtual universe traversal blocks 416that follow each acceptor's teleportation acceptance block. In decisionblock 419, compare a ratio 417 of continuing virtual universe traversalblocks 416 to teleportation acceptance blocks 407 with a threshold value418. Given the teachings herein, the skilled artisan will be able topick suitable threshold values. In a non-limiting example, a suitablethreshold value might be in the range of 0.9 to 1.0, with a numbersmaller than 1.0 being used to account for virtual universe users whohave accepted a teleportation invitation but who have not yet chosen totraverse from the teleportation destination. In case (Y branch ofdecision block 419) the ratio 417 is less than the threshold value 418,at step 420 designate the host 400 as potentially malicious. Otherwise,(N branch of decision block 419) simply wait for the next assessmentthat is required, as indicated by the un-numbered “continue” block. Atthe step 319, in response to the host 400 being designated aspotentially malicious, designate the teleportation invite as potentiallymalicious.

On the other hand, referring to FIG. 5, another protocol for assessing318 whether the virtual universe teleportation invite 314 is potentiallymalicious relates to the parameter 308 that identifies a virtualuniverse location as a destination 501 of the invite 314. In this case,the assessment 318 includes assessing 502 whether the destination 501 ispotentially malicious. First, obtain, at step 504, a plurality 506 ofteleportation acceptance blocks 507 that identify the destination 501;each of the teleportation acceptance blocks defines a virtual universeuser as an acceptor 408. Also, obtain for each acceptor 408, at step510, a plurality 512 of traversal blocks 317 that record virtualuniverse traversal events by the acceptor 408. Then, at step 514,analyze each plurality 512 of traversal blocks 317 in an effort toidentify “continuing” virtual universe traversal events 516 that followeach acceptor's teleportation acceptance block 507. In decision block519, compare a ratio 517 of continuing virtual universe traversal events516 to teleportation acceptance blocks 507 with a threshold value 518.Given the teachings herein, the skilled artisan will be able to picksuitable threshold values. In a non-limiting example, a suitablethreshold value might be in the range of 0.9 to 1.0. In case (Y branchof decision block 519) the ratio 517 is less than the threshold value518, at step 520 designate the destination 501 as potentially malicious.Otherwise, (N branch of decision block 519) simply wait for the nextassessment that is required, as indicated by the un-numbered “continue”block. At the step 319, in response to the destination 501 beingdesignated as potentially malicious, designate the teleportation inviteas potentially malicious.

FIG. 6 depicts another method 600 for assessing whether a destination501 is potentially malicious. This implementation includes, at step 602,obtaining a plurality 612 of traversal blocks 613 that record outgoingand incoming virtual universe traversal events 614, 616 at thedestination 501. In decision block 619, the method 600 compares a ratio617 of outgoing virtual universe traversal events 614 to incomingvirtual universe traversal events 616 at the destination with athreshold value 618. Given the teachings herein, the skilled artisanwill be able to pick suitable threshold values. In a non-limitingexample, a suitable threshold value might be in the range of 0.9 to 1.0.At step 620, in response to the ratio 617 being less than the thresholdvalue (Y branch of decision block 619), the implementation includes step620 of designating the destination as potentially malicious. Otherwise,(N branch of decision block 619) simply wait for the next assessmentthat is required, as indicated by the un-numbered “continue” block.

Thus, according to certain implementations of the method 300, either adestination or a host may be selected as the parameter that marks theteleportation invite and the teleportation acceptance. In either case,the destination or the host can be assessed for whether it ispotentially malicious and, if so, then the teleportation invite alsowill be designated as potentially malicious.

Another aspect of assessing whether a location or host is potentiallymalicious, is to evaluate a quantity or quality of complaints madeagainst the location or host by other users of the virtual universe. Forexample, a location or a host with a number of complaints or negativecomments in excess of a threshold number can be designated aspotentially malicious. In such an implementation, “negative comments”could be identified by natural language processing (e.g., using latentDirichlet allocation).

Referring to FIG. 7, another useful aspect of the invention is depicted.As shown in FIG. 7, the virtual universe traversal result trackingmodule 96 implements a method 700 for predicting a risk of harassment bya virtual universe user 701 (the “griefer”). The method 700 begins atstep 702 of obtaining at least one complaint block 704 that records acomplaint 706 made against the griefer 701. The method 700 analyzes thehistoric movements of the griefer 701 in an effort to identify a patternof harassment that caused the complaint 706. More particularly, at step708 obtain a plurality of traversal blocks 710 that record virtualuniverse traversal events by the griefer 701, then at step 712 identifya pattern of harassment through step 713 of analyzing a first plurality714 of traversal blocks 710 that precede the complaint block 704. Theanalysis 713 of the first plurality 714 of traversal blocks 710 can beaccomplished by various protocols. One protocol is to reference thegriefer's behavior to behaviors of other users that also receivedsimilar complaints 715. In other words, the step 713 of analyzing thefirst plurality 714 of traversal blocks 710 is rule-based, and the rulesare derived (e.g., by a cognitive neural network) from a plurality ofother complaints 715 against a plurality of other virtual universe usersand from a plurality of other users' traversal blocks 716 that recordvirtual universe traversal events by the plurality of other virtualuniverse users.

Generally, a cognitive neural network includes a plurality of computerprocessors that are configured to work together to implement one or moremachine learning algorithms. The implementation may be synchronous orasynchronous. In a neural network, the processors simulate thousands ormillions of neurons, which are connected by axons and synapses. Eachconnection is enforcing, inhibitory, or neutral in its effect on theactivation state of connected neural units. Each individual neural unithas a summation function which combines the values of all its inputstogether. In some implementations, there is a threshold function orlimiting function on at least some connections and/or on at least someneural units, such that the signal must surpass the limit beforepropagating to other neurons. A cognitive neural network can implementsupervised, unsupervised, or semi-supervised machine learning.

Accordingly, the rules can be derived by machine learning. In certainimplementations, supervised learning is used because the plurality ofcomplaints provide clear output signals while the pluralities oftraversal blocks provide well-defined input signals. The rules can beused to identify which aspects of the griefer's behavior, i.e. whichtraversal blocks 710, are most strongly associated with the complaint706. Various rules and methods may be used to detect griefers, at acertain degree of confidence.

Exemplary rules and methods include a crowdsourcing approach, whereplayers can report griefing. Malicious players then can be labelled, anddealt with later. Griefing in the form of inappropriate avatar-to-avataraggressive behavior may be detected by using methods to detect pushing,shoving, and related behaviors, perhaps particularly among avatars whohave not met in the past. In certain embodiments, inappropriate (e.g.threatening) language is detected responsive to natural languageprocessing methods. In certain embodiments, inappropriate or destructivesoftware can be detected and users or avatars running such software canbe flagged.

The traversal blocks 710 may represent all sorts of traversal eventsinvolving the griefer 701: not only walking, running, vehicularmovement, or teleportation by the griefer, but also and in someimplementations more importantly, teleportation invites by the griefer.Thus, for example, the method 700 may include identifying 712 that thegriefer received the complaint 706 after inviting a fellow user toteleport to an inescapable location or to a location that will cause theuser's avatar to cease functioning.

Some embodiments of the invention are directed to “reforming” a griefer.The preceding steps, alone, could be helpful toward educating thegriefer what behavior to avoid. However, some embodiments can useadditional techniques besides hindsight.

The method 700 further includes identifying 717 a risk of futureharassment by analyzing 718 a second plurality 719 of traversal blocks710 that follow the complaint block 704. According to certain aspects ofthe invention, analyzing 717 the second plurality 719 of traversalblocks 710 is rule-based and the rules are derived from the complaint706, from the first plurality 714 of traversal blocks 710, from aplurality of other complaints 715 against a plurality of other virtualuniverse users, and from a plurality of other users' traversal blocks716 that record virtual universe traversal events by the plurality ofother virtual universe users. Thus, the past behavior of other users, aswell as the griefer's own past behavior, informs the search forpotentially problematic current behaviors. This constitutes blockchainreverse correlation (“BCRC”).

In case the method 700 does identify 717 a risk of future harassment,the next step is issuing 720 an alert regarding the risk of futureharassment. In certain implementations, the alert is issued directly tothe griefer 701 in an effort to moderate the griefer's behavior. Inother implementations, the alert is issued to another virtual universeuser apparently targeted by the griefer 701. For example, the alert maybe issued responsive to the griefer teleporting within an interactivedistance from another virtual universe user, where “interactivedistance” will be defined by the parameters and physics of the virtualuniverse as a distance within which the griefer can exert an effect(whether physically or by communication) on the other virtual universeuser. As another example, the alert may be issued responsive to thegriefer inviting the other virtual universe user to teleport, perhaps toa particular location that has previously produced complaints againstthe griefer or against other users.

Given the discussion thus far, the skilled worker will appreciate that,in general terms, one aspect of the invention provides an exemplarycomputer-implemented method, which includes obtaining at least oneteleportation invite block that records a virtual universe teleportationinvite marked by at least one parameter, where the teleportation inviteidentifies a virtual universe user as an invitee. The exemplary methodalso includes assessing, responsive to the parameter, whether thevirtual universe teleportation invite is potentially malicious, andalerting the invitee in case the virtual universe teleportation inviteis potentially malicious.

For example, according to certain implementations of the exemplarymethod the parameter may identify a virtual universe user as a host ofthe teleportation invite. In at least some such cases, assessing whetherthe virtual universe teleportation invite is potentially maliciousincludes assessing whether the host is potentially malicious. Assessingwhether the host is potentially malicious may include obtaining aplurality of teleportation acceptance blocks marked by the at least oneparameter that identifies the host; each teleportation acceptance blockdefines a virtual universe user as an acceptor. Such implementations ofthe exemplary method then include obtaining for each acceptor aplurality of traversal blocks that record virtual universe traversalevents by the acceptor; analyzing the pluralities of traversal blockscorresponding to the plurality of acceptors to identify continuingvirtual universe traversal events that follow each acceptor'steleportation acceptance block; and in case a ratio of continuingvirtual universe traversal events to teleportation acceptance blocks isless than a threshold value, designating the host as potentiallymalicious.

According to certain other implementations of the invention, theparameter may identify a virtual universe location as a destination ofthe teleportation invite. In at least some such cases, assessing whetherthe virtual universe teleportation invite is potentially maliciousincludes assessing whether the destination is potentially malicious.Assessing whether the destination is potentially malicious may includeobtaining a plurality of teleportation acceptance blocks marked by theparameter; each teleportation acceptance block defines a virtualuniverse user as an acceptor. Such implementations of the exemplarymethod then include obtaining for each acceptor a plurality of traversalblocks that record virtual universe traversal events by the acceptor;analyzing the pluralities of traversal blocks corresponding to theplurality of acceptors to identify continuing virtual universe traversalevents that follow each acceptor's teleportation acceptance block; andin case a ratio of continuing virtual universe traversal events toteleportation acceptance blocks is less than a threshold value,designating the destination as potentially malicious. On the other hand,assessing whether the destination is potentially malicious may includeobtaining a plurality of traversal blocks that record outgoing andincoming virtual universe traversal events at the destination; and incase the destination has a ratio of outgoing virtual universe traversalevents to incoming virtual universe traversal events that is less than athreshold value, designating the destination as potentially malicious.For example, the threshold value may be in a range of 0.9 to 1.0.

According to certain implementations of the exemplarycomputer-implemented method, the teleportation acceptance block mayidentify a virtual universe user as an acceptor, in which case themethod may also include obtaining a plurality of traversal blocks thatrecord virtual universe traversal events by the acceptor; analyzing theplurality of traversal blocks to identify continuing virtual universetraversal events that follow the acceptor's teleportation acceptanceblock within a defined period of time; and in case no continuing virtualuniverse traversal events are identified, selecting a destination of theteleportation acceptance as the parameter. Alternatively oradditionally, certain implementations may include, in case no continuingvirtual universe traversal events are identified, selecting a host ofthe teleportation acceptance as the parameter.

Other implementations of the exemplary computer-implemented method mayinclude obtaining a plurality of teleportation acceptance blocks markedby the parameter, wherein each teleportation acceptance block defines avirtual universe user as an acceptor, and obtaining for each acceptor aplurality of traversal blocks that record virtual universe traversalevents by the acceptor. Such implementations then include analyzing thepluralities of traversal blocks corresponding to the plurality ofacceptors to identify continuing virtual universe traversal events thatfollow each acceptor's teleportation acceptance block; and in case aratio of continuing virtual universe traversal events to teleportationacceptance blocks is less than a threshold value, alerting the inviteethat the virtual universe teleportation invite is potentially malicious.

Another aspect of the invention provides a computer-implemented methodthat includes obtaining at least one complaint block that records acomplaint made against a virtual universe user; obtaining a plurality oftraversal blocks that record virtual universe traversal events by thevirtual universe user; identifying a pattern of harassment by analyzinga first plurality of traversal blocks that precede the complaint block;identifying a risk of future harassment by analyzing a second pluralityof traversal blocks that follow the complaint block; and issuing analert regarding the risk of future harassment. For example, analyzingthe first plurality of traversal blocks may be rule-based with the rulesbeing derived from a plurality of other complaints against a pluralityof other virtual universe users and from a plurality of other users'traversal blocks that record virtual universe traversal events by theplurality of other virtual universe users. Additionally, analyzing thesecond plurality of traversal blocks may be rule-based with the rulesbeing derived from the complaint, from the first plurality of traversalblocks, from a plurality of other complaints against a plurality ofother virtual universe users, and from a plurality of other users'traversal blocks that record virtual universe traversal events by theplurality of other virtual universe users.

According to certain implementations of the method, the virtual universetraversal events may include teleportation events. For example, theteleportation events may include teleportation invites issued by thevirtual universe user.

According to certain implementations of the method, the alert may beissued to the virtual universe user. For example, the alert may beissued responsive to the virtual universe user teleporting within aninteractive distance from another virtual universe user. Alternatively,the alert may be issued to another virtual universe user. For example,the alert may be issued responsive to the virtual universe user invitingthe other virtual universe user to teleport.

Certain embodiments of the invention provide an apparatus that includesa memory encoded with computer-executable instructions and a processoroperatively coupled in communication with the memory. The processor isconfigured by the computer-executable instructions to facilitate any ofthe methods above discussed.

Thus, techniques of the present invention can provide substantialbeneficial technical effects. For example, one or more embodimentsprovide one or more of:

A permanent and unbreakable link between a user and the user's traversalevents. That link—the distributed and tamperproof record oftraversal—can be verified and tracked.

A user can share the user's traversal record with friends, family orfans securely. Transferring traversals is made as easy as transferringor copying a traversal record. Consider that traversal data is added tothe block in the form of: userid, source location, destination location,method of travel, etc. for each time a user teleports from one locationto another location or moves by a certain amount in a VU. Thisinformation may be added to the growing blockchain for a user. In oneembodiment, a user may transfer (that is, “share”) this information withother users (which is akin to sharing a travel tour or special travelitinerary in a virtual world or game) with others. For example, a user'straversal pattern may be shared as a special URL via e-mail or socialmedia.

Reliably tracing where and how a user's traversals spread in the VU or3D game. Embodiments of the invention can show all the locations auser's avatar has appeared and its movements over time.

A built-in certificate of authenticity (“COA”), a unique cryptographicID associated with the complete segment history. The COA can be verifiedanytime and printed out.

Unique, limited editions of traversal webs, which may be informative butalso attractive to look at. Digital editions make it possible to own andtransfer the permissions for digital traversals. Thus, embodiments ofthe invention enable users to transfer, consign, or loan their traversalpaths and diagrams without losing attribution. Any transaction generatedby a user is cryptographically signed by the user using a private key(i.e. via a transaction generator module). The other nodes can validatethat the transaction is signed by the user, by reference to the signerpublic key. Transactions can be validated through the replicatedexecution of the smart contract (i.e. chaincode) and given the faultassumption underlying consensus algorithm (e.g. BFT in hyperledgerblockchain fabric, which implements that among the n validating peers atmost f<n/3 may “lie” and behave arbitrarily, but all others execute thechaincode correctly.) The confirmation of the transaction validationentails ownership, and then writes the transaction (and ownership info)on the ledger. The particular choice of public key cryptographyimplementation depends on the design of the blockchain.

Enhanced detection of malicious teleportation invite to un-escapablelocation within a virtual universe through rating analysis of theteleportation location, a historical teleportation analysis of thepossessor/host (griefer analysis), etc. responsive to data from a single“point of truth.”

Enhanced alert system for outputting a set of possibly maliciousteleportation location invites.

Enhanced augmented functionality of the VU traversal via the use ofBlockchain Reverse Correlation (BRC) that makes use of the grieferbehavior report by another user of the VU to trigger the accessing ofthe blockchain in order to perform statistics on the blocks precedingthe report by some number of steps and/or a specified amount of time.

Improved tracking of VU traversal by permanently storing and managingevents related to teleportation of items on blockchain: the send id,receiver id, an item or avatar token (the fingerprint of the item oravatar using which historical details of the item or avatar can beretrieved), metadata information (e.g. timestamp, location, path taken,etc.), distance traveled, VU or 3D context/environment information, etc.

One or more embodiments of the invention, or elements thereof, can beimplemented in the form of an apparatus including a memory and at leastone processor that is coupled to the memory and operative to performexemplary method steps. FIG. 8 depicts a computer system that may beuseful in implementing one or more aspects and/or elements of theinvention, also representative of a cloud computing node according to anembodiment of the present invention. Referring now to FIG. 8, cloudcomputing node 10 is only one example of a suitable cloud computing nodeand is not intended to suggest any limitation as to the scope of use orfunctionality of embodiments of the invention described herein.Regardless, cloud computing node 10 is capable of being implementedand/or performing any of the functionality set forth hereinabove.

In cloud computing node 10 there is a computer system/server 12, whichis operational with numerous other general purpose or special purposecomputing system environments or configurations. Examples of well-knowncomputing systems, environments, and/or configurations that may besuitable for use with computer system/server 12 include, but are notlimited to, personal computer systems, server computer systems, thinclients, thick clients, handheld or laptop devices, multiprocessorsystems, microprocessor-based systems, set top boxes, programmableconsumer electronics, network PCs, minicomputer systems, mainframecomputer systems, and distributed cloud computing environments thatinclude any of the above systems or devices, and the like.

Computer system/server 12 may be described in the general context ofcomputer system executable instructions, such as program modules, beingexecuted by a computer system. Generally, program modules may includeroutines, programs, objects, components, logic, data structures, and soon that perform particular tasks or implement particular abstract datatypes. Computer system/server 12 may be practiced in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

As shown in FIG. 8, computer system/server 12 in cloud computing node 10is shown in the form of a general-purpose computing device. Thecomponents of computer system/server 12 may include, but are not limitedto, one or more processors or processing units 16, a system memory 28,and a bus 18 that couples various system components including systemmemory 28 to processor 16.

Bus 18 represents one or more of any of several types of bus structures,including a memory bus or memory controller, a peripheral bus, anaccelerated graphics port, and a processor or local bus using any of avariety of bus architectures. By way of example, and not limitation,such architectures include Industry Standard Architecture (ISA) bus,Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, VideoElectronics Standards Association (VESA) local bus, and PeripheralComponent Interconnect (PCI) bus.

Computer system/server 12 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 12, and it includes both volatileand non-volatile media, removable and non-removable media.

System memory 28 can include computer system readable media in the formof volatile memory, such as random access memory (RAM) 30 and/or cachememory 32. Computer system/server 12 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, storage system 34 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk such as a CD-ROM, DVD-ROM or other optical media can be provided.In such instances, each can be connected to bus 18 by one or more datamedia interfaces. As will be further depicted and described below,memory 28 may include at least one program product having a set (e.g.,at least one) of program modules that are configured to carry out thefunctions of embodiments of the invention.

Program/utility 40, having a set (at least one) of program modules 42,may be stored in memory 28 by way of example, and not limitation, aswell as an operating system, one or more application programs, otherprogram modules, and program data. Each of the operating system, one ormore application programs, other program modules, and program data orsome combination thereof, may include an implementation of a networkingenvironment. Program modules 42 generally carry out the functions and/ormethodologies of embodiments of the invention as described herein.

Computer system/server 12 may also communicate with one or more externaldevices 14 such as a keyboard, a pointing device, a display 24, etc.;one or more devices that enable a user to interact with computersystem/server 12; and/or any devices (e.g., network card, modem, etc.)that enable computer system/server 12 to communicate with one or moreother computing devices. Such communication can occur via Input/Output(I/O) interfaces 22. Still yet, computer system/server 12 cancommunicate with one or more networks such as a local area network(LAN), a general wide area network (WAN), and/or a public network (e.g.,the Internet) via network adapter 20. As depicted, network adapter 20communicates with the other components of computer system/server 12 viabus 18. It should be understood that although not shown, other hardwareand/or software components could be used in conjunction with computersystem/server 12. Examples, include, but are not limited to: microcode,device drivers, redundant processing units, and external disk drivearrays, RAID systems, tape drives, and data archival storage systems,etc.

Thus, one or more embodiments can make use of software running on ageneral purpose computer or workstation. With reference to FIG. 8, suchan implementation might employ, for example, a processor 16, a memory28, and an input/output interface 22 to a display 24 and externaldevice(s) 14 such as a keyboard, a pointing device, or the like. Theterm “processor” as used herein is intended to include any processingdevice, such as, for example, one that includes a CPU (centralprocessing unit) and/or other forms of processing circuitry. Further,the term “processor” may refer to more than one individual processor.The term “memory” is intended to include memory associated with aprocessor or CPU, such as, for example, RAM (random access memory) 30,ROM (read only memory), a fixed memory device (for example, hard drive34), a removable memory device (for example, diskette), a flash memoryand the like. In addition, the phrase “input/output interface” as usedherein, is intended to contemplate an interface to, for example, one ormore mechanisms for inputting data to the processing unit (for example,mouse), and one or more mechanisms for providing results associated withthe processing unit (for example, printer). The processor 16, memory 28,and input/output interface 22 can be interconnected, for example, viabus 18 as part of a data processing unit 12. Suitable interconnections,for example via bus 18, can also be provided to a network interface 20,such as a network card, which can be provided to interface with acomputer network, and to a media interface, such as a diskette or CD-ROMdrive, which can be provided to interface with suitable media.

Accordingly, computer software including instructions or code forperforming the methodologies of the invention, as described herein, maybe stored in one or more of the associated memory devices (for example,ROM, fixed or removable memory) and, when ready to be utilized, loadedin part or in whole (for example, into RAM) and implemented by a CPU.Such software could include, but is not limited to, firmware, residentsoftware, microcode, and the like.

A data processing system suitable for storing and/or executing programcode will include at least one processor 16 coupled directly orindirectly to memory elements 28 through a system bus 18. The memoryelements can include local memory employed during actual implementationof the program code, bulk storage, and cache memories 32 which providetemporary storage of at least some program code in order to reduce thenumber of times code must be retrieved from bulk storage duringimplementation.

Input/output or I/O devices (including but not limited to keyboards,displays, pointing devices, and the like) can be coupled to the systemeither directly or through intervening I/O controllers.

Network adapters 20 may also be coupled to the system to enable the dataprocessing system to become coupled to other data processing systems orremote printers or storage devices through intervening private or publicnetworks. Modems, cable modem and Ethernet cards are just a few of thecurrently available types of network adapters.

As used herein, including the claims, a “server” includes a physicaldata processing system (for example, system 12 as shown in FIG. 8)running a server program. It will be understood that such a physicalserver may or may not include a display and keyboard.

One or more embodiments can be at least partially implemented in thecontext of a cloud or virtual machine environment, although this isexemplary and non-limiting. Reference is made back to FIGS. 1-2 andaccompanying text.

It should be noted that any of the methods described herein can includean additional step of providing a system comprising distinct softwaremodules embodied on a computer readable storage medium; the modules caninclude, for example, any or all of the appropriate elements depicted inthe block diagrams and/or described herein; by way of example and notlimitation, any one, some or all of the modules/blocks and orsub-modules/sub-blocks described. The method steps can then be carriedout using the distinct software modules and/or sub-modules of thesystem, as described above, executing on one or more hardware processorssuch as 16. Further, a computer program product can include acomputer-readable storage medium with code adapted to be implemented tocarry out one or more method steps described herein, including theprovision of the system with the distinct software modules.

One example of user interface that could be employed in some cases ishypertext markup language (HTML) code served out by a server or thelike, to a browser of a computing device of a user. The HTML is parsedby the browser on the user's computing device to create a graphical userinterface (GUI).

Exemplary System and Article of Manufacture Details

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer readable program instructions by utilizing state information ofthe computer readable program instructions to personalize the electroniccircuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the blocks may occur out of theorder noted in the Figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

What is claimed is:
 1. A computer-implemented method comprising:obtaining at least one complaint block that records a complaint madeagainst a virtual universe user; obtaining a plurality of traversalblocks that record virtual universe traversal events by the virtualuniverse user; identifying a pattern of inappropriate behavior towardsone or more other virtual universe users by analyzing a first pluralityof traversal blocks that precede the complaint block; identifying a riskof future inappropriate behavior towards one or more other virtualuniverse users by analyzing a second plurality of traversal blocks thatfollow the complaint block; and issuing an alert regarding the risk ofthe future inappropriate behavior towards one or more other virtualuniverse users.
 2. The method of claim 1 wherein analyzing the firstplurality of traversal blocks is rule-based and the rules are derivedfrom a plurality of other complaints against a plurality of othervirtual universe users and from a plurality of other users' traversalblocks that record virtual universe traversal events by the plurality ofother virtual universe users.
 3. The method of claim 1 wherein thevirtual universe traversal events comprise teleportation events.
 4. Themethod of claim 3 wherein the teleportation events compriseteleportation invites issued by the virtual universe user.
 5. The methodof claim 2 wherein the alert is issued to the virtual universe user. 6.The method of claim 5 wherein the alert is issued responsive to thevirtual universe user teleporting within an interactive distance fromanother virtual universe user.
 7. The method of claim 1 wherein thealert is issued to another virtual universe user.
 8. The method of claim7 wherein the alert is issued responsive to the virtual universe userinviting the other virtual universe user to teleport.
 9. An apparatuscomprising: a memory; and at least one processor, coupled to saidmemory, and operative to: obtain at least one complaint block thatrecords a complaint made against a virtual universe user; obtain aplurality of traversal blocks that record virtual universe traversalevents by the virtual universe user; identify a pattern of inappropriatebehavior towards one or more other virtual universe users by analyzing afirst plurality of traversal blocks that precede the complaint block;identify a risk of future inappropriate behavior towards one or moreother virtual universe users by analyzing a second plurality oftraversal blocks that follow the complaint block; and issue an alertregarding the risk of the future inappropriate behavior towards one ormore other virtual universe users.
 10. The apparatus of claim 9 whereinanalyzing the first plurality of traversal blocks is rule-based and therules are derived from a plurality of other complaints against aplurality of other virtual universe users and from a plurality of otherusers' traversal blocks that record virtual universe traversal events bythe plurality of other virtual universe users.
 11. The apparatus ofclaim 9 wherein the virtual universe traversal events compriseteleportation events.
 12. The apparatus of claim 11 wherein theteleportation events comprise teleportation invites issued by thevirtual universe user.
 13. The apparatus of claim 10 wherein the alertis issued to the virtual universe user.
 14. The apparatus of claim 13wherein the alert is issued responsive to the virtual universe userteleporting within an interactive distance from another virtual universeuser.
 15. The apparatus of claim 9 wherein the alert is issued toanother virtual universe user.
 16. The apparatus of claim 15 wherein thealert is issued responsive to the virtual universe user inviting theother virtual universe user to teleport.
 17. A non-transitory computerreadable medium comprising computer executable instructions which whenexecuted by a computer cause the computer to perform a method of:obtaining at least one complaint block that records a complaint madeagainst a virtual universe user; obtaining a plurality of traversalblocks that record virtual universe traversal events by the virtualuniverse user; identifying a pattern of inappropriate behavior towardsone or more other virtual universe users by analyzing a first pluralityof traversal blocks that precede the complaint block; identifying a riskof future inappropriate behavior towards one or more other virtualuniverse users by analyzing a second plurality of traversal blocks thatfollow the complaint block; and issuing an alert regarding the risk ofthe future inappropriate behavior towards one or more other virtualuniverse users.
 18. The non-transitory computer readable medium of claim17 wherein analyzing the first plurality of traversal blocks isrule-based and the rules are derived from a plurality of othercomplaints against a plurality of other virtual universe users and froma plurality of other users' traversal blocks that record virtualuniverse traversal events by the plurality of other virtual universeusers.
 19. The non-transitory computer readable medium of claim 17wherein the virtual universe traversal events comprise teleportationevents.
 20. The non-transitory computer readable medium of claim 19wherein the teleportation events comprise teleportation invites issuedby the virtual universe user.